Capacity of Non-Malleable Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Malleable Codes

We introduce the notion of “non-malleable codes” which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error-correction and error-detection, nonmalleability can be achieved for very rich classes of modifications. We constr...

متن کامل

Continuous Non-malleable Codes

Non-malleable codes are a natural relaxation of error correcting/detecting codes that have useful applications in the context of tamper resilient cryptography. Informally, a code is non-malleable if an adversary trying to tamper with an encoding of a given message can only leave it unchanged or modify it to the encoding of a completely unrelated value. This paper introduces an extension of the ...

متن کامل

Non-Malleable Codes

In this report,based on the paper of Dziembowski et al.'s [DPW10], we explain how we can construct an e cient code that is nonmalleable with respect to modi cations that e ect each bit of the codeword arbitrarily. A variety of modi cations of codewords are considered such as ipping each bit of the codeword, leaving it untouched, or setting it to either 0 or 1 but independently of the value of t...

متن کامل

Leakage-Resilient Non-malleable Codes

A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the leakage attacks in which the adversary obtains some information about the internal state of the machine, and the tampering attacks where the adversary can modify this state. One of the popular tools used to provide tamper-resistance are th...

متن کامل

Block-Wise Non-Malleable Codes

Non-malleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10) provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c′ either decodes to m or to “something unrelated” to m. It is known that non-malleable codes cannot exist for the class of all tampering functions and hence a lot of work has focused on explicitly constructing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2016

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2015.2511784